An application of proof-theory in ASP
نویسندگان
چکیده
Using a characterization of stable models of logic programs P as satisfying valuations of a suitably chosen propositional theory, called the set of reduced defining equations rEq P , we show that the finitary character of that theory rEq P is equivalent to a certain continuity property of the Gelfond-Lifschitz operator GLP associated with the program P .
منابع مشابه
Fuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملApplication of Graph Theory: Relationship of Topological Indices with the Partition Coefficient (logP) of the Monocarboxylic Acids
It is well known that the chemical behavior of a compound is dependent upon the structure of itsmolecules. Quantitative structure – activity relationship (QSAR) studies and quantitative structure –property relationship (QSPR) studies are active areas of chemical research that focus on the nature ofthis dependency. Topological indices are the numerical value associated with chemical constitution...
متن کاملFractional order Adaptive Terminal Sliding Mode Controller Design for MPPT in a Solar Cell under Normal and Partial Shading Condition
In this paper, by combining fractional calculus and sliding mode control theory, a new fractional order adaptive terminal sliding mode controller is proposed for the maximum power point tracking in a solar cell. To find the maximum power point, the incremental conductance method has been used. First, a fractional order terminal sliding mode controller is designed in which the control law depend...
متن کاملA New Proof of FDR Control Based on Forward Filtration
For multiple testing problems, Benjamini and Hochberg (1995) proposed the false discovery rate (FDR) as an alternative to the family-wise error rate (FWER). Since then, researchers have provided many proofs to control the FDR under different assumptions. Storey et al. (2004) showed that the rejection threshold of a BH step-up procedure is a stopping time with respect to the reverse filtration g...
متن کاملA short proof of the maximum conjecture in CR dimension one
In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007